Optimized Graph-Based Trust Mechanisms using Hitting Times
نویسندگان
چکیده
Trust mechanisms can be computed by modeling a set of agents in a trust graph, a directed weighted graph in which agents are represented as vertices and relative trust as edges. Liu, Parkes, and Seuken [LPS16] present trust mechanisms that are robust against sybil attacks, including the proposed personalized hitting time (PHT) mechanism. In this paper, we propose a scalable algorithm for producing trust scores. In particular, we improve on the theoretical bound quoted by [LPS16] for computing PHT scores and other hitting time-based trust mechanisms.
منابع مشابه
Symmetry in Quantum Walks
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. We derive an expression for hitting time using superoperators, and numerically evaluate it for the walk on the hypercube for various ...
متن کاملFrom random walks to distances on unweighted graphs
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the significance of this problem, statistical characterization of the proposed metrics has been limited. We introduce and develop a class of techniques for analyzin...
متن کاملGraph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
In this paper, we explore analytically and experimentally a quasi-quantum analogue of the hitting time of the continuous-time quantum walk on a graph. For the classical random walk, the hitting time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved performance. Our analysis shows that the quasi-quantum analogue of the hitt...
متن کاملAn Eigenvalue Representation for Random Walk Hitting times and Its Application to the Rook Graph
Given an aperiodic random walk on a finite graph, an expression will be derived for the hitting times in terms of the eigenvalues of the transition matrix. The process of diagonalizing the transition matrix and its associated fundamental matrix will be discussed. These results will then be applied to a random walk on a rook graph. Lastly, a cover time bound depending on the hitting times will b...
متن کاملHitting and commute times in large graphs are often misleading
Next to the shortest path distance, the second most popular distance function between vertices in a graph is the commute distance (resistance distance). For two vertices u and v, the hitting time Huv is the expected time it takes a random walk to travel from u to v. The commute time is its symmetrized version Cuv = Huv + Hvu. In our paper we study the behavior of hitting times and commute dista...
متن کامل